Anonymity-Proof Voting Rules
نویسنده
چکیده
A (randomized, anonymous) voting rule maps any multiset of total orders of (aka. votes over) a fixed set of alternatives to a probability distribution over these alternatives. A voting rule f is neutral if it treats all alternatives symmetrically. It satisfies participation if no voter ever benefits from not casting her vote. It is falsename-proof if no voter ever benefits from casting additional (potentially different) votes. It is anonymity-proof if it satisfies participation and it is false-name-proof. We show that the class of anonymity-proof neutral voting rules consists exactly of the rules of the following form. With some probability kf ∈ [0, 1], the rule chooses an alternative at random. With probability 1− kf , the rule first draws a pair of alternatives at random. If every vote prefers the same alternative between the two (and there is at least one vote), then the rule chooses that alternative. Otherwise, the rule flips a fair coin to decide between the two alternatives.
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملExistential Assertions for Voting Protocols
In [22], we extend the Dolev-Yao model with assertions. We build on that work and add existential abstraction to the language, which allows us to translate common constructs used in voting protocols into proof properties. We also give an equivalencebased definition of anonymity in this model, and prove anonymity for the FOO voting protocol.
متن کاملAn axiomatic theory of political representation
We discuss the theory of gerrymandering-proof voting rules. Our approach is axiomatic. We show that, for votes over a binary set of alternatives, any rule that is unanimous, anonymous, and gerrymandering-proof must decide a social outcome as a function of the proportions of agents voting for each alternative, and must either be independent of this proportion, or be in one-to-one correspondence ...
متن کاملApproximately Strategy-Proof Voting
The classic Gibbard-Satterthwaite Theorem establishes that only dictatorial voting rules are strategy-proof; under any other voting rule, players have an incentive to lie about their true preferences. We consider a new approach for circumventing this result: we consider randomized voting rules that only approximate a deterministic voting rule and only are approximately strategy-proof. We show t...
متن کاملAutomated Verification for Functional and Relational Properties of Voting Rules
In this paper, we formalise classes of axiomatic properties for voting rules, discuss their characteristics, and show how symmetry properties can be exploited in the verification of other properties. Following that, we describe how automated verification methods such as software bounded model checking and deductive verification can be used to verify implementations of voting rules. We present a...
متن کامل